Rigid Reachability
نویسندگان
چکیده
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of a new rather restricted kind of second-order unification. We also show that certain decidable subclasses of the problem which are P-complete in the equational case become EXPTIME-complete when symmetry is absent. By applying automata-theoretic methods, simultaneous monadic rigid reachability with ground rules is shown to be in EXPTIME.
منابع مشابه
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Lie Product of Matrix Functions and Its Application to Reachability Analysis for Dynamical Systems with Matrix-valued States
Time evolutions of some important control targets such as quantum sate or attitude of a rigid body are described by matrix-valued differential equations. In this report, we introduce “Lie product of matrix functions” as a new tool for differential geometric approach to analysis of such systems. A direct and efficient way to calculate the Lie product of matrix functions is provided, which enable...
متن کاملStability Analysis of Discontinuous Systems with Impacts and Friction via Sums-of-Squares
Michael Posa and Russ Tedrake Massachusetts Institute of Technology email: mposa, russt at mit.edu 1 Motivation Many critical tasks in robotics, particularly locomotion, involve collisions between a rigid body and the environment or between multiple bodies. Sums-of-squares (SOS) based methods for numerical computation of Lyapunov certificates are a powerful tool for analyzing the stability of c...
متن کاملRolling Bodies with Regular Surface : the Holonomic Case
In this paper we analyse the nonholonomic nature of the constraint of pure (non{slipping) rolling between rigid bodies. Besides its theoretical interest in mechanics, the problem is of practical momentum in applications such as dexterous manipulation of objects by means of robotic hands. We study this problem by recasting it in terms of reachability analysis of a nonlinear system of ODE's. Our ...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملFinite-time fault tolerant attitude control for over-activated spacecraft subject to actuator misalignment and faults
A finite-time attitude compensation control scheme is developed for an over-activated rigid spacecraft subject to actuator faults, misalignment, external disturbances and uncertain inertia parameters. The controller is synthesised based on the sliding mode control theory, and guarantees the finite-time reachability of the system states. A sufficient condition for the controller to accommodate m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998